Lepton: An automaton for Literate Executable Papers
نویسندگان
چکیده
منابع مشابه
Service Level Management for Executable Papers
Reproducibility of Science is considered as one of the main principles of the scientific method, and refers to the ability of an experiment to be accurately reproduced, by third person, in complex experiment every detail matters to ensure the correct reproducibility. In the context of the ICCS 2011, Elsevier organized the executable paper grand challenge a contest to improve the way scientific ...
متن کاملAdessowiki - Collaborative platform for writing executable papers
Adessowiki is a collaborative platform for scientific programming and document writing. It is a wiki environment that carries simultaneously documentation, programming code and results of its execution without any software configuration such as compilers, libraries and special tools at the client side. This combination of a collaborative wiki environment, central server and execution of code at...
متن کاملAn Icon Taxonomy for Semi-Literate Communities
Icons, or pictorial and graphical objects, are commonly used in human-computer interaction (HCI) fields as the mediator in order to communicate information to users. However, there have been little studies focusing on the majority of the world’s population – semi-literate communities – in terms of icon design. In this study, a new icon taxonomy of four quadrants, namely abstract-general, abstra...
متن کاملThe Planetary System: Executable Science, Technology, Engineering and Math Papers
Executable scientific papers contain not just layouted text for reading. They contain, or link to, machine-comprehensible representations of the scientific findings or experiments they describe. Client-side players can thus enable readers to “check, manipulate and explore the result space” [9]. We have realized executable papers in the STEM domain with the Planetary system. Semantic annotations...
متن کاملAn automaton group: a computational case study
We introduce a two generated weakly branch contracting automaton group $G$ which is generated by a two state automaton on a three letter alphabet. Using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. Furthermore some algebraic properties of $G$ are detected .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Open Source Software
سال: 2019
ISSN: 2475-9066
DOI: 10.21105/joss.01005